package com.person.leetcode.editor.cn;

import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;

/**
  * 675.为高尔夫比赛砍树
  * 2022-05-23 09:34:28
**/
public class Sequence_0675_CutOffTreesForGolfEvent {
    public static void main(String[] args) {
        Solution solution = new Sequence_0675_CutOffTreesForGolfEvent().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {

//         1 2 3 4
//         1 2 3 4
//         1 2 3 4
        //广度遍历 0->无穷 左右上下
    public int cutOffTree(List<List<Integer>> forest) {
        int i=0,j=0;
        forest.get(i).get(j);
        new PriorityQueue<Integer>();
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
